Confluently Persistent Deques via Data Structural Bootstrapping

Con uently Persistent Deques via Data-Structural Bootstrapping

We introduce data-structural bootstrapping, a technique to design data structures recursively, and use it to design con uently persistent deques. Our data structure requires O(log k) worstcase time and space per deletion, where k is the total number of deque operations, and constant worst-case time and space for other operations. Further, the data structure allows a purely functional implementa...

Confluent persistence revisited

It is shown how to enhance any data structure in the pointer model to make it confluently persistent, with efficient query and update times and limited space overhead. Updates are performed in O(log n) amortized time, and following a pointer takes O(log c log n) time where c is the in-degree of a node in the data structure. In particular, this proves that confluent persistence can be achieved a...

Simple Confluently Persistent Catenable Lists (Extended Abstract)

Simple Confluently Persistent Catenable Lists

We consider the problem of maintaining persistent lists subject to concatenation and to insertions and deletions at both ends. Updates to a persistent data structure are nondestructive{each operation produces a new list incorporating the change while keeping intact the list or lists to which it applies. Although general techniques exist for making data structures persistent, these techniques fa...

DSaaS - A Cloud Service for Persistent Data Structures

In an attempt to tackle shortcomings of current approaches to collaborating on the development of structured data sets, we present a prototype platform that allows users to share and collaborate on the development of data structures via a web application, or by using language bindings or an API. Using techniques from the theory of persistent linked data structures, the resulting platform delive...